Reasoning About Knowledge In Linear Logic: Modalities and Complexity
نویسندگان
چکیده
In a recent paper, Jean-Yves Girard commented that ”it has been a long time since philosophy has stopped intereacting with logic”[17]. Actually, it has not been such a ”long” time since, e.g., Dag Prawitz and Michael Dummett developed philosophical arguments within the paradigm of Gentzen-style systems in favour of the adoption of intuitionistic logic. But recent developments within logic have left philosophers far behind. Prawitz’s timely book Natural Deduction [?], along with a key result obtained at around the same time, the Curry-Howard isomorphism [21], initiated deep changes within logic; to wit, the development of the substructural logics [?, ?]. Dummett developed within proof-theoretical semantics a mature version of his anti-realist challenge, closely allied to Prawitz’s own philosophical considerations. But within the debate generated since by Dummett’s anti-realism, philosophers have for the most part not paid much attention to the developments within logic since the 1970s. The almost complete absence of any discussion of linear logic within this context should convince any one that there is something seriously amiss here. The present paper is related to an attempt by Jacques Dubucs to provide a new impetus to the anti-realism debate by providing a radical anti-realist line of argument that also ties the debate more closely to issues of concern within substructural logics [?, 9, 10]. We shall only make brief remarks about his argument in section 1. Our intention is to push it a few steps further and explore the possibilities for a radically anti-realist epistemic logic. In a nutshell, it has been suggested that a radical form of anti-realism should force one to look at structural rules within Gentzen-style systems that are responsible for the idealizations of the full structural logic. By ’idealization’ we merely mean features of structural logic which allow for infinities to creep in, so to speak, and which should not go without notice within the interpretation of proofs as actions that has dominated much of the thinking about prooftheoretical semantics since the days of Prawitz and Dummett (e.g., in the work
منابع مشابه
Complex Epistemic Modalities in the Situation Calculus
We develop a formal account of complex group-level epistemic modalities in the situation calculus, with a particular focus on reasoning about common knowledge. Expressions involving common knowledge cannot be handled by standard regression techniques and are thus difficult to reason about effectively. Taking our cue from recent promising work in dynamic epistemic logic, we overcome this limitat...
متن کاملComplete Axiomatizations for Reasoning about Knowledge and Branching Time
Sound and complete axiomatizations are provided for a number of different logics involving modalities for the knowledge of multiple agents and operators for branching time, extending previous work of Halpern, van der Meyden and Vardi [to appear, SIAM Journal on Computing] for logics of knowledge and linear time. The paper considers the system constraints of synchrony, perfect recall and unique ...
متن کاملReasoning about CTL∗ with Graded Path Modalities
Graded path modalities count the number of paths satisfying a property, and generalize the existential (E) and universal (A) path modalities of CTL∗. The resulting logic is denoted GCTL∗, and is a very powerful logic since (as we show) it is equivalent to monadic path logic. We settle the complexity of the satisfiability problem of GCTL∗, i.e., 2EXPTIME-COMPLETE, and the complexity of the model...
متن کاملA Set-Theoretic Approach to Automated Deduction in Graded Modal Logics
In the paper, we consider the problem of supporting automated reasoning in a large class of knowledge representation formalisms, including terminological and epistemic logics, whose distinctive feature is the ability of representing and reasoning about finite quantities. Each member of this class can be represented using graded modalities, and thus the considered problem can be reduced to the p...
متن کاملOn the Impact of Strati cation on the Complexity of Nonmonotonic Reasoning
This paper investigates the problem of nding subclasses of nonmono-tonic reasoning which can be implemented eeciently. The ability to deenee propositions using default assumptions about the same propositions is identiied as a major source of computational complexity in nonmonotonic reasoning. If such constructs are not allowed, i.e. stratiied knowledge bases are considered, a signiicant computa...
متن کاملOn the Impact of Stratification on the Complexity of Nonmonotonic Reasoning
This paper investigates the problem of finding subclasses of nonmonotonic reasoning which can be implemented efficiently. The ability to “define” propositions using default assumptions about the same propositions is identified as a major source of computational complexity in nonmonotonic reasoning. If such constructs are not allowed, i.e. stratified knowledge bases are considered, a significant...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004